An Adaptive Chebyshev Iterative Method for Nonsymmetric Linear Systems Based on Modiied Moments
نویسندگان
چکیده
Large, sparse nonsymmetric systems of linear equations with a matrix whose eigenvalues lie in the right half plane may be solved by an iterative method based on Chebyshev polynomials for an interval in the complex plane. Knowledge of the convex hull of the spectrum of the matrix is required in order to choose parameters upon which the iteration depends. Adaptive Chebyshev algorithms , in which these parameters are determined by using eigenvalue estimates computed by the power method or modiications thereof, have been described by Manteuuel 18]. This paper presents an adaptive Chebyshev iterative method, in which eigenvalue estimates are computed from modiied moments determined during the iterations. The computation of eigenvalue estimates from modiied moments requires less computer storage than when eigenvalue estimates are computed by a power method and yields faster convergence for many problems.
منابع مشابه
Adaptive Chebyshev Iterative Methods for Nonsymmetric Linear Systems Based on Modified Moments bY
Large, sparse nonsymmetric systems of linear equations with a matrix whose eigenvalues lie in the right half plane may be solved by an iterative method based on Chebyshev polynomials for an interval in the complex plane. Knowledge of the convex hull of the spectrum of the matrix is required in order to choose parameters upon which the iteration depends. Adaptive Chebyshev algorithms, in which t...
متن کاملThe superiority of a new type (2, 2)-step iterative method over the related Chebyshev method
A new type ð2; 2Þ-step iterative method related to an optimal Chebyshev method is developed for solving real and nonsymmetric linear systems of the form Ax 1⁄4 b. It is an extension of the ð2; 2Þ-step iterative method introduced in [Numer. Linear Algebra Appl. 7 (2000) 169]. The superiority of the new type ð2; 2Þ-step iterative method over the optimal Chebyshev method is derived in the case whe...
متن کاملApproximating Dominant Singular Triplets of LargeSparse Matrices via Modi ed Moments
A procedure for determining determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modiied moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel im...
متن کاملITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods
ITPACK 2C is a collection of seven FORTRAN subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Basic iterative procedures, such as the Jacobi method, the Successive Overrelaxation method, the Symmetric Successive Overrelaxation method, and the RS method for the reduced system are combined, where possible, with acceleration procedures such as Chebysh...
متن کاملRecent Advances in Lanczos-Based Iterative Methods for Nonsymmetric Linear Systems
In recent years, there has been a true revival of the nonsymmetric Lanczos method. On the one hand, the possible breakdowns in the classical algorithm are now better understood, and so-called look-ahead variants of the Lanczos process have been developed, which remedy this problem. On the other hand, various new Lanczos-based iterative schemes for solving nonsymmetric linear systems have been p...
متن کامل